Leader Election by d Dimensional Cellular Automata
نویسندگان
چکیده
We present a cellular algorithm in O(w) for the leader election problem on a finite connected subset F of ZZ of excentricity w, for any fixed d. The problem consists in finding an algorithm such that when setting the elements of F to a special state, and all the others to a state #, the cellular automaton iterates a finite number of steps and eventually sets only one precise element of F to a special state called leader state, and all the others to a different state. We describe the algorithm in detail, outline its proof and complexity, and discuss the possible extensions on more general Cayley graphs.
منابع مشابه
Leader election on two-dimensional periodic cellular automata
This article explores the computational power of bi-dimensional cellular automata acting on periodical configurations. It extends in some sense the results of a similar paper dedicated to the one-dimensional case. More precisely, we present an algorithm that computes a “minimal pattern network”, i.e. a minimal pattern and the two translation vectors it can use to tile the entire configuration. ...
متن کاملAnonymous Leader Election in One- and Two-Dimensional Cellular Automata
Leader election plays a crucial role in numerous distributed protocols, multi-agent systems and biological societies. Yet there is a fundamental gap in understanding its simplest variant, such as, in cellular automata, employing components that are fully uniform, deterministic, and anonymous. In this thesis, we investigate various oneand two-dimensional binary state cellular automata that elect...
متن کاملAn Efficient Cellular Automata based Leader Election Scheme
This work reports an efficient scheme of electing a leader, in a fully connected distributed system, having n number of nodes. In the proposed scheme, the system state is modeled using Cellular Automata. Each node is initialized with status information. This information has to be maintained by the nodes at all times so that they are aware of the current working coordinator in the system. The pr...
متن کاملLeader election in plane cellular automata, only with left-right global convention
We give a linear time algorithm to elect a leader. This problem originated in networking and distributed computing research. Given a graph, its vertices represent processors (here 2nite state machines), and its edges communication lines (here synchronous). The leader election problem consists in 2nding a protocol for a family of graphs which, upon iteration, distinguishes a vertex, edge or cycl...
متن کامل